Method And System For Mapping A Boolean Logic Network To A Limited Set Of Application-Domain Specific Logic Cells

ABSTRACT

A method and system is described for mapping a system-level description of an integrated system directly to a technology-specific set of logic cells that are comprised primarily of large complex cells (bricks). The invention is based on applying aggressive Boolean operations that would be of impractical runtime complexity for a large library, but are applicable for the targeted brick libraries which typically contain a small number of complex cells, along with a much smaller number of simple cells. This invention is modular such that it can be applied in the context of incremental netlist optimization as well as optimization during physical synthesis.

RELATED APPLICATIONS

This application is a continuation-in-part of U.S. patent applicationSer. No. 11/619,587 filed Jan. 3, 2007 entitled “Method For TheDefinition Of A Library Of Application-Domain-Specific Logic Cells”, andclaims priority to U.S. Provisional Application No. 60/883,332 filedJan. 3, 2007entitled “A Method and System For Grouping Logic In AnIntegrated Circuit Design To Minimize Number Of Transistors And NumberOf Unique Geometry Patterns,” both of which are expressly incorporatedby reference herein.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention is related to integrated circuit design, and, moreparticularly, a method and system for mapping a Boolean logic network toa limited set of application-domain specific logic cells.

2. Field of the Related Art

Typical integrated circuit design environments make use of libraries ofpre-designed standard cells (a cell library) which usually consist offrom 500 cells to more than 1,000 cells. These libraries are composed ofa number of simple, generic and standard logic functions that have beenimplemented in a form suitable for manufacturing. Each standard cell isa representation, typically the mask level representation, of thecircuit that performs the logic function for that cell.

The logic functions performed by the cells in a typical cell library areintentionally general purpose and basic and the majority of themrepresent common, low-level logic functions such as AND, OR, XOR,AND-OR-INVERT (AOI), Multiplexer, Adder, etc. These are functions arerepresentative of patterns that are recognized by logic designers, andthose that are used as the building blocks for manual logic design. Fullcustom logic design at the transistor level can sometimes includecomplex AOI functions that are identifiable from their logicdescription, such as:

(ā+ b)(c+d)

But such functions are typically not included in standard celllibraries, and not representative of specific basic building blocks thatare known to logic designers. Instead, they are more likely to be customdesigned at the transistor level as an AOI gate.

In a typical integrated circuit (IC) design flow an IC design istranslated to logic gates. In most cases this translation is performedby an automatic logic synthesis tool to derive a netlist based on a setof the aforementioned generic logic functions. This translation is oftennecessary as there are many different methods in common use for designspecification. Those methods may include specification using ahigh-level programming language such as Verilog, VHDL or C or bymanually entering schematics using a computer-aided design system.

As a high level language cannot be directly implemented into thephysical layout of an integrated circuit, it is first converted to agate level implementation. The result of the conversion is arepresentation of the design called a gate level netlist. Thisrepresentation is usually in the form of simple logic functions such asNAND, NOR, etc. along with a representation of the connections betweenfunctions (the netlist).

Automatic logic synthesis tools are then generally used to bind a designto an implementation, based on a set of manufacturing technologyspecific logic cells from a cell library. The synthesis tool selectscells from the library based on a set of implementation goals that mayinclude any combination of metrics related to area, performance or powerand possibly manufacturing yield, to obtain a cell-based netlist. Logicsynthesis, as is known, is generally the process of transformation of anRTL or a Boolean network such that its functionality is not altered intoa form that is aligned for technology mapping.

Within the context of the conventional design flow as described above,techniques for optimization using regularity extraction have beenproposed for designs dominated by datapaths, which are formed by a smallnumber of repeating logic elements (or bit slices) that areinterconnected in a very organized pattern, and other regular circuitstructures including RAMs, PLAs, array multipliers etc. For suchdesigns, identifying repeating regularity in circuits simplifies theeffort required via synthesis, optimization and layout. However, suchregularity extraction techniques rely on the assumption that the designsinherently have within them a high degree of regularity. For example,most of these techniques use information such as bus names and datapathfeatures such as high-fanout control nets to identify repeatingstructures, such as bit slices. These techniques do not apply,therefore, to more general design flows and logic descriptions that arewithout such organization and repetition. Also, these techniques toidentify repeating regularity do not modify the underlying structural orfunctional topology of the circuit, which further makes them ineffectivefor generalized logic and random logic applications.

In light of the above background, the typical commercial flow that isused in mapping a Boolean network to a set of technology-specificstandard cell gates, is shown in FIG. 1. A Boolean network can berepresented by a directed acyclic graph where each node is a Booleanfunction of one of three types: a primary input, internal, output. ABoolean network may not contain a directed cycle. Each internal node ina Boolean network represents a Boolean function of its fanins. A Booleannetwork may contain internal nodes with arbitrarily large number offanins. The Boolean network is first decomposed into a subject graph (agraph which represents the design independent of a specific technologyor library using simple logic primitives (most commonly AND and INV) toform the technology-independent netlist. Subsequently, the subject graphis then typically mapped to a cell library using structural/Booleanmatching followed by binate covering against pre-stored patternsrepresenting the cells in the library. As the cells in the library getmore complex, the matching complexity increases exponentially. Moreover,this method suffers from a structure bias; i.e, the mapping quality isdependent on the subject graph structure which is often derived withlittle knowledge of the characteristics of the target cell library.

SUMMARY OF THE INVENTION

The present invention relates to mapping a Boolean logic network to alimited set of application-domain specific logic cells.

In one aspect, a method and system is described for mapping asystem-level description of an integrated system directly to atechnology-specific set of logic cells that are comprised primarily oflarge complex cells (bricks). The invention is based on applyingaggressive Boolean operations that would be of impractical runtimecomplexity for a large library, but are applicable for the targetedbrick libraries which typically contain a small number of complex cells,along with a much smaller number of simple cells. This invention ismodular such that it can be applied in the context of incrementalnetlist optimization as well as optimization during physical synthesis.

In a particular aspect, there is described a method of mapping abehavioral, RTL or unmapped Boolean network to a small library of logiccomponents to represent the network as different ones of the logiccomponents that are connected together. The method includes obtainingthe behavioral, RTL or unmapped Boolean network; identifying the smalllibrary of logic components, the small library of logic componentsincluding a set of complex functions and a set of simple functions,wherein the set of complex functions includes a plurality ofnon-standard complex Boolean logic functions and wherein substantiallyall of the plurality of non-standard complex Boolean logic functionseach have at least three inputs, and wherein the set of simple logicfunctions, together with the set of complex functions, can togethercompletely specify the network; and mapping the network to the smalllibrary of logic components using aggressive Boolean operations toobtain a mapped network, wherein the mapping includes directly mappinglarge functions from the network to different ones of the non-standardcomplex Boolean logic functions without the large functions from thenetwork being decomposed, wherein most of the network is mapped tocertain ones of the plurality of non-standard complex Boolean logicfunctions.

SUMMARY OF THE DRAWINGS

These and other aspects and features of the present invention willbecome apparent to those of ordinary skill in the art upon review of thefollowing description of specific embodiments of the invention inconjunction with the accompanying figures, wherein:

FIG. 1 illustrates a typical commercial flow that is used in mapping aBoolean network to a set of technology-specific standard cell gates.

FIG. 2 illustrates an overview of the present invention;

FIG. 3 illustrates a flowchart of the direct brick mapping according tothe present invention.

FIG. 4 illustrates a flow diagram for incremental netlist optimizationaccording to the present invention.

FIG. 5 illustrates decomposition of a node according to the presentinvention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

A method and system are described to map a behavioral level (afunctional description level for which the mapping to the final statemachine is not specified. There is no description of how the variablesmap to circuit memory elements), RTL or system-level logic netlist to asmall library of logic components (no fewer than 5 and no more than 50unique logic functions). One intended application of this invention isto leverage the unique advantages offered by small libraries ofapplication-domain specific logic bricks, such as described in U.S.application Ser. No. 11/619,587 filed Jan. 3, 2007 and entitled “MethodFor The Definition Of A Library Of Application-Domain-Specific LogicCells,” referred to previously.

IC design with increased regularity for manufacturabilty can incur apenalty in terms of area and performance. It is important, therefore, toexploit this regularity with circuits and methodologies that canovercome some or all of these penalties. Exploiting the large logicfunctions that are grouped for macro-regularity to maximize the logicutilization on the chip can provide a significant improvement in botharea and performance. Improvements in IC area and performance are ofgreat commercial value and all IC application domains. The presentinvention addresses this.

Specifically, this invention describes a logic synthesis method to map abehavioral, RTL or system-level logic netlist to a library that isprimarily composed of bricks or large logic cells (typically having 6-12inputs, with substantially all of the large logic cells having at least3 inputs). Our method takes advantage of the property that the bricklibrary has a small number of cells compared to typical commercialstandard-cell libraries that can contain hundreds or thousands of cells,as described in the previously referenced application.

In contrast to the conventional commercial flow that is used in mappinga Boolean network to a set of technology-specific standard cell gates,the present invention starts by directly mapping a Boolean network ontoa target library without any need for decomposition into a subjectgraph. Decomposition is the process of simplifying nodes by identifyingand adding new Boolean nodes (with smaller number of fanins) to thenetwork. In general, most decomposition algorithms work by choosing afactor and re-expressing the network in terms of that new factor anditerating until no new factors are found. This is achieved by directdecomposition of Boolean nodes into cells/bricks. Since a Booleannetwork can contain internal nodes with arbitrarily large number offanins, the general method of decomposition attempts to simplify suchnodes by identifying and adding new Boolean nodes (with smaller numberof fanins) to the network. In general, the prior art for decompositionalgorithms are based on choosing a factor and re-expressing the networkin terms of that new factor and iterating until no new factors arefound.

This general set of decomposition techniques for logic optimization andtechnology mapping (the process of transforming a circuit netlist into anetwork of interconnected components/cells of a given library. By meansof technology mapping, a design can be targeted to a design style suchas standard cells, FPGAs or gate arrays) have evolved with thedevelopment of standard cell-based design methodology. As a result, theyare very specific to optimization of standard cells, and do not workwell for large cells or bricks. The complexity of the cells in a bricklibrary (also referred to as library that includes a set of complexfunctions includes a plurality of non-standard complex Boolean logicfunctions that are each derived from the identified logic functionpatterns of the recurring Boolean logic chains in the utilityapplication incorporated by reference above) is considerably higher thanthose of typical standard cells, and the number of cells in a bricklibrary (typically 5-50) is less than in a typical standard cell library(typically 700-2000). As described in more detail in the utilityapplication incorporated by reference, efficiency with a small celllibrary is sometimes obtained by generating the library to beapplication specific, or application domain specific. Based on theoutlined differences, existing methods used for binding a system level(e.g. RTL) description to a specific technology library are inefficientfor brick libraries.

For example, the complexity of typical matching algorithms used duringthe matching stages of technology mapping grows exponentially with thenumber of inputs of the cells in the target technology library. A targettechnology library is one have a collection of cells that performprimitive Boolean logic functions in a specific technology or a designstyle. Further, logic decomposition and multi-level optimization areseparate steps from technology mapping with very little interaction.Since a brick library has limited functionality, it provides for anopportunity to tightly couple these steps while having a tractablecomplexity of the computation. Although, there is work (see E. Lehman etal, “Logic decomposition during technology mapping”, IEEE Trans. CAD,16(8), 1997, pp. 813-833) that proposes a technique that combinesalgebraic decomposition with technology mapping, it is based ontree-matching onto a mapping graph, and thus suffers from structurebias. Further, the mapping graph does not scale with the size-complexityof Boolean functions, thereby making it impractical for application tolibraries of bricks or large cells.

FIG. 2 illustrates an overview of the present invention, which takes asinputs the Boolean network to be technology mapped, the limited libraryof bricks (potentially derived for a specific application-domain) and aset of design constraints that describe the area as well as delay goals.The input Boolean network might be one that is obtained from theregister transfer level (RTL) description of a circuit after performingsome technology independent optimization. This Boolean network is thentechnology mapped via decomposition and recomposition to bricks, asdescribed hereinafter, following the design constraints andspecifications.

One aspect of the uniqueness of the present invention is that each celland its precise characteristics are considered while performing logicsynthesis. This is not possible during decomposition to standard cellsdue to the small cell sizes and the overwhelmingly complex number ofpossible decompositions due to the number of unique logic cells.

Since bricks are by definition dominated by large complex cells (cellswith at least 3 inputs and 3 levels of internal logic depth as definedin the utility patent application incorporated by reference herein), thepresent invention does not use tree or DAG (directed acyclic graph)matching. Instead, during logic decomposition, decompositions are chosenfor which the logic functions match a cell or brick in the library, asshown in the flow diagram of FIG. 3.

The present invention continues iteratively by decomposing anyun-decomposed logic, and backtracking as necessary until all logic isdecomposed into large function bricks and a few selected logic brickprimitives (where percentage of cells that are simple primitives istypically no more than 15% of the total number of cells/bricks) . Theinvention further considers that decomposition is coupled withre-composition moves. Logic recomposition is the opposite ofdecomposition, during which nodes in the multilevel network arecollapsed into their respective fanout nodes. Logicrecomposition/collapse is the process of eliminating factors from anetwork usually resulting in an increase in complexity of nodes in thenetwork. This creates an opportunity for which more efficientdecompositions can be discovered. In the university software tool SIS,(See SIS: A System for Sequential Circuit Synthesis. Robert K. BraytonAlberto Sangiovanni-Vincentelli et. al, EECS, University of California,Berkeley), recomposition (termed as eliminate) is driven by a maximumincrease in the number of (user specified) literals in the network. Thenumber of literals has been shown to roughly represent the complexity ofa Boolean network. For example in U.S. Pat. No. 6,958,545 therecomposition moves are chosen in order to minimize congestion duringthe physical synthesis (the process of implementing the mask for acircuit netlist including buffer insertion and minor logic changes toaccommodate for design constraints). An aspect of the present inventionwith respect to recomposition is that the following two types ofsub-networks are considered for recomposition:

1. Sub-networks that match a cell or brick in the library, including thelarge complex bricks that are not found in standard cell libraries. Thisis achieved by structural or Boolean matching.

2. Sub-networks that are heuristically estimated to be efficientlydecomposable into cells/bricks after re-composition.

FIG. 3 highlights the mapping flow according to the present invention,including the decomposition and recomposition.

An important aspect of this invention is that the cost function for thelogic decomposition and optimization are measured in part by:

-   -   Placement information (if applied during physical synthesis)    -   Wireload estimates (when applied during frontend        synthesis)→statistical wireloads    -   Timing, area and power characteristics of the bricks

The present invention has the following properties that contribute toits novelty:

-   -   1. A method to directly transform an RTL/Unmapped Boolean        network into a technology-specific design representation that is        defined by a library of 5 to 50 cells (brick), with 85% or more        of those cells corresponding to large complex logic functions of        at least 3 inputs and at least 3 levels of logic. An unmapped        Boolean network is a Boolean network where the implementation of        nodes in a specific technology is not defined. The functionality        of each node is defined abstractly. e.g. using the sum of        products form.    -   2. A method to directly transform an RTL/Unmapped Boolean        network into a cell (brick) level Boolean network based on a        target cell (brick) library using Boolean decomposition.    -   3. The method in 2 for which the direct mapping further        facilitates the optimization of specific attributes (e.g. Area,        Delay, Power) during decomposition that would otherwise be        impractical with a larger library.    -   4. The RTL/Unmapped Boolean network described in 1 might have        been obtained in any of the following ways        -   a. Human designed        -   b. Logic collapsed/re-composed from a gate level            implementation which might have undergone logic synthesis            and/or physical synthesis        -   c. Created via behavioral synthesis    -   5. The target brick library in 1 contains characterization data        for the bricks that provides metrics for the targeted design        attributes in 1. This data can also be derived during the        processes described in the present invention using the process        for transistor-level optimization described in the provisional        application incorporated be reference herein. The Boolean        functions of the bricks are derived as described in the utility        application incorporated by reference herein.    -   6. The transformation in 1 is performed by iteratively using the        following procedures, of which at least one takes the target        brick library into account:        -   a. Decomposition of nodes in the Boolean network        -   b. Re-composition of nodes in the Boolean network    -   7. The decomposition in 6.a computes the cost function of        various potential decomposition choices and performs the        decomposition using the best choice. The cost function        calculation uses the data in the target brick library using one        of the following methods:        -   a. Heuristic (Area and/or delay and/or power) estimation of            the composition and/or the decomposition function when it is            fully or partially implemented by the cells in the target            library. A decomposition function is a candidate Boolean            function (factor) that may be added to the network during            decomposition.        -   b. Exact (Area and/or delay and/or power) computation by            recursively implementing the composition and/or            decomposition function using the method in 1.        -   c. Exact (Area and/or delay and/or power) computation by            matching the composition and/or decomposition function to a            brick in the target Brick library.

Further, the decomposition can be of type disjoint or non-disjoint.

-   -   8. The decomposition in 7 also considers the possibility of        sharing the decomposition functions (Bricks from the target        brick library) as factors among multiple Boolean nodes in the        network.    -   9. Re-composition in 6.b evaluates the re-composition choices at        a node and performs re-composition using the best choice. The        cost function calculation takes the target brick library into        account by calculating the cost function of the resulting        collapsed Boolean function in one of the following ways:        -   a. Heuristic (Area and/or delay and/or power) estimation of            the collapsed function when it is fully or partially            implemented by the cells in the target library.        -   b. Exact (Area and/or delay and/or power) computation by            recursively implementing the collapsed function using the            method in 1.        -   c. Exact (Area and/or delay and/or power) computation by            matching the collapsed function to a Brick in the target            Brick library.    -   10. The transformation procedure in 1 can be applied in the        context of incremental optimization of a netlist. This can be        done by selectively highlighting a sub-network and then        remapping it using the procedure in 1. A flow-chart of this        process is shown in FIG. 4.    -   11. The process in 9 can be applied to perform incremental        optimization on the gate level netlist after some physical        prototyping or full physical synthesis. In this case the cost        function in 7 & 8 are evaluated using the information from the        physical prototype/implementation, e.g. placement co-ordinates,        wire loads, etc.

The following illustrates certain particular aspects of the mappingprocess that are unique in the context of the present invention.

A behavioral, RTL or an unmapped Boolean network is technology mapped tothe small library of logic brick components (containing the set ofcomplex functions and the set of simple functions, with the set ofcomplex functions being the non-standard complex Boolean logicfunctions) using aggressive Boolean operations. Unmapped Booleanfunctions in the Boolean network are tested against each Brick in theBrick library for Boolean factoring. One way to test for factors is viaBoolean division. In this manner, the Boolean network is technologymapped by directly mapping Boolean factors of the nodes in the Booleannetwork to complex Bricks that correspond to complex, non-traditionallogic functions. Such aggressive Boolean operations would be ofimpractical runtime complexity for a large library. In contrast,existing methods (e.g. SIS: A System for Sequential Circuit Synthesis.Robert K. Brayton Alberto Sangiovanni-Vincentelli et. al, EECS,University of California, Berkeley) employ algebraic factoring or weakdivision during the technology independent stage prior to technologymapping to reduce the complexity of the Boolean network before mappingthe network to a standard cell library.

Referring to FIG. 3, each unmapped node in the Boolean network is mappedto bricks until all the nodes in the network get mapped. For example,referring to FIG. 5, we can consider starting with a Boolean function F(of an unmapped node) being technology mapped and derive all thesupport-reducing bound-sets (Is) of F, where the cardinality of eachbound-set is less than N (N is the maximum number of inputs for any cellin the target brick library). Next, each brick in the target library isevaluated using each bound-set in Is to evaluate a cost function.

The cost function can be designed to achieve a certain area-timingand/or power tradeoff. The brick, Bb, that minimizes the cost functionis chosen to decompose F (See FIG. 5) into a network that has a Booleanfunction f being driven by the brick Bb. An example of a cost functionthat can be used to optimize the area of the mapped circuit:

C=M(f)+α×area(Bb)

where, M(f) is the number of literals in the minimized SOP(sum-of-products) form of the composition function (f). The compositionfunction is a Boolean function which represents the decomposed node interms of the decomposition functions (factors). The minimization can becarried out by a literal based minimization tool such as Espresso (SeeSIS: A System for Sequential Circuit Synthesis. Robert K. BraytonAlberto Sangiovanni-Vincentelli et. al, EECS, University of California,Berkeley). The area(Bb) is the area foot-print of the brick B. Thenormalization factor (a) depends on the actual area foot-prints of cellsin the target brick library.

Another example of a cost function which trades-off between area anddelay is:

C=M(f)+_α×area(B)+β_×Max(Criticality(X1))

here, X1 is the set of pins in the bound set. The criticality of a pinis defined as the minimum slack that each input has with respect to someoutput. The weighting factors α and β are adjusted for trading-offtiming and area. The cost function biases the algorithm towards theselection of bricks with bound set inputs that are not critical.

In order to further optimize for area, we perform logic sharing(factoring) of the decomposition functions (Bricks) as follows. Whileevaluating the cost function during the selection of a brick, Bb, duringdecomposition of node F, other nodes in the neighborhood of F areaconsidered for decomposition using the same brick. The selection ofbricks which can form factors, as opposed to decompositions, is biasedby the cost function for area.

The foregoing detailed description of the invention has been presentedfor purposes of illustration and description. It is not intended to beexhaustive or to limit the invention to the precise form disclosed. Manymodifications and variations are possible in light of the aboveteaching. The described embodiments were chosen in order to best explainthe principles of the invention and its practical application to therebyenable others skilled in the art to best utilize the invention invarious embodiments and with various modifications as are suited to theparticular use contemplated.

1. A method of mapping a behavioral, RTL or unmapped Boolean network toa small library of logic components to represent the network asdifferent ones of the logic components that are connected together, themethod comprising the step of: obtaining the behavioral, RTL or unmappedBoolean network; identifying the small library of logic components, thesmall library of logic components including a set of complex functionsand a set of simple functions, wherein the set of complex functionsincludes a plurality of non-standard complex Boolean logic functions andwherein substantially all of the plurality of non-standard complexBoolean logic functions each have at least three inputs, and wherein theset of simple logic functions, together with the set of complexfunctions, can together completely specify the network; and mapping thenetwork to the small library of logic components using aggressiveBoolean operations to obtain a mapped network, wherein the mappingincludes directly mapping large functions from the network to differentones of the non-standard complex Boolean logic functions without thelarge functions from the network being decomposed, wherein most of thenetwork is mapped to certain ones of the plurality of non-standardcomplex Boolean logic functions.
 2. The method according to claim 1wherein the step of mapping further includes the steps of: decomposingother functions from the network; subsequently recomposing other largefunctions using the decomposed other functions; and further mapping atleast some of the recomposed large functions directly to different onesof the non-standard complex Boolean logic functions.
 3. The methodaccording to claim 1 wherein the step of mapping maps functions from thenetwork that do not correspond to the non-standard complex Boolean logicfunctions using the simple functions from the small library.
 4. Themethod according to claim 1 wherein the logic decomposition in the stepof mapping uses a cost function.
 5. The method according to claim 4wherein the cost function is affected by placement information.
 6. Themethod according to claim 4 wherein the cost function is affected bywireload estimates.
 7. The method according to claim 4 wherein the costfunction is affected by at least one of timing, area and powercharacteristics of each of the non-standard complex Boolean logicfunctions.